On multiple blocking sets in Galois planes

نویسندگان

  • A. Blokhuis
  • L. Lovász
  • L. Storme
  • T. Szőnyi
چکیده

This article continues the study of multiple blocking sets in PG(2, q). In [3], using lacunary polynomials, it was proven that t-fold blocking sets of PG(2, q), q square, t < q1/4/2, of size smaller than t(q + 1) + cqq 2/3, with cq = 2 −1/3 when q is a power of 2 or 3 and cq = 1 otherwise, contain the union of t pairwise disjoint Baer subplanes when t ≥ 2, or a line or a Baer subplane when t = 1. We now combine the method of lacunary polynomials with the use of algebraic curves to improve the known characterization results on multiple blocking sets and to prove a t (mod p) result on small t-fold blocking sets of PG(2, q = pn), p prime, n ≥ 1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper Bounds on the Covering Number of Galois-Planes with Small Order

Our paper deals with a problem of P. Erd} os' related to the covering number of blocking sets of nite projective planes. An integer linear programming (ILP) formulation of Erd} os' problem is introduced for projective planes of given orders. The mathematical programming based approach for this problem is new in the area of nite projective planes. Since the ILP problem is NP-hard and may involve...

متن کامل

Small proper double blocking sets in Galois planes of prime order

A proper double blocking set in PG(2, p) is a set B of points such that 2 |B ∩ l| (p + 1) − 2 for each line l. The smallest known example of a proper double blocking set in PG(2, p) for large primes p is the disjoint union of two projective triangles of side (p+ 3)/2; the size of this set is 3p+ 3. For each prime p 11 such that p ≡ 3 (mod 4) we construct a proper double blocking set with 3p + 1...

متن کامل

Multiple blocking sets and arcs in finite planes

This paper contains two main results relating to the size of a multiple blocking set in PG(2, q). The first gives a very general lower bound, the second a much better lower bound for prime planes. The latter is used to consider maximum sizes of (k, n)-arcs in PG(2, 11) and PG(2, 13), some of which are determined. In addition, a summary is given of the value of mn(2, q) for q ≤ 13.

متن کامل

Sets of Type (d1, d2) in projective Hjelmslev planes over Galois Rings

In this paper we construct sets of type (d1, d2) in the projective Hjelmslev plane. For computational purposes we restrict ourself to planes over Zps with p a prime and s > 1, but the method is described over general Galois rings. The existence of sets of type (d1, d2) is equivalent to the existence of a solution of a Diophantine system of linear equations. To construct these sets we prescribe ...

متن کامل

A spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd

This article presents a spectrum result on minimal blocking sets with respect to the planes of PG(3, q) , q odd. We prove that for every integer k in an interval of, roughly, size [q 2 /4, 3q 2 /4] , there exists such a minimal blocking set of size k in PG(3, q) , q odd. A similar result on the spectrum of minimal blocking sets with respect to the planes of PG(3, q) , q even, was presented in [...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005